Second Order Duality in Multiobjective Programming With Generalized Convexity
نویسندگان
چکیده
منابع مشابه
Second Order Duality in Multiobjective Programming With Generalized Convexity
The purpose of this paper is concerned with a class of multi objective programming problems in which the objective functions and constrained functions are twice differentiable and containing the support functions of a compact convex set. For such mathematic programming, to deal with its dual problem, first, the concept of second order ( , ) B p r invexity is introduced. Further, the Mangasa...
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملSecond Order Duality in Multiobjective Programming
A nonlinear multiobjective programming problem is considered. Weak, strong and strict converse duality theorems are established under generalized second order (F, α, ρ, d)-convexity for second order Mangasarian type and general Mond-Weir type vector duals.
متن کاملSecond order (F, α, ρ, d)-convexity and duality in multiobjective programming
A class of second order (F,a,q,d)-convex functions and their generalizations is introduced. Using the assumptions on the functions involved, weak, strong and strict converse duality theorems are established for a second order Mond–Weir type multiobtive dual. 2005 Elsevier Inc. All rights reserved.
متن کاملSecond Order (b,F)-Convexity in Multiobjective Nonlinear Programming
A new class of functions namely, second order (b,F)-convex functions, which is an extension of (b,F)-convex functions and second order F-convex functions, is introduced. Sufficient optimality conditions for proper efficiency and second order mixed type duality theorems for multiobjective nonlinear programming problems are established under the assumptions of second order (b,F)-convexity on the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Grid and Distributed Computing
سال: 2014
ISSN: 2005-4262,2005-4262
DOI: 10.14257/ijgdc.2014.7.5.15